On the Decorrelated Fast Cipher (DFC) and Its Theory
نویسندگان
چکیده
In the first part of this paper the decorrelation theory of Vaudenay is analysed. It is shown that the theory behind the proposed constructions does not guarantee security against state-of-the-art differential attacks. In the second part of this paper the proposed Decorrelated Fast Cipher (DFC), a candidate for the Advanced Encryption Standard, is analysed. It is argued that the cipher does not obtain provable security against a differential attack. Also, an attack on DFC reduced to 6 rounds is given.
منابع مشابه
Decorrelated Fast Cipher: An AES Candidate Well Suited for Low Cost Smart Card Applications
In response to the call for candidates issued by the National Institute for Standards and Technologies (the Advanced Encryp-tion Standard project) the Ecole Normale Sup erieure proposed a candidate called DFC as for \Decorrelated Fast Cipher", based on the decor-relation technique that provides provable security against several classes of attacks (in particular the basic version of Biham and Sh...
متن کاملDecorrelated Fast Cipher: an Aes Candidate Well Suited for Low Cost Smart Cards Applications
In response to the call for candidates issued by the National Institute for Standards and Technologies (the Advanced Encryption Standard project) the Ecole Normale Sup erieure proposed a candidate called DFC as for \Decorrelated Fast Cipher", based on the decorrelation technique that provides provable security against several classes of attacks (in particular the basic version of Biham and Sham...
متن کاملDecorrelated Fast Cipher : an AES
This report presents a response to the call for candidates issued by the National Institute for Standards and Technologies (the Advanced Encryption Standard project). The proposed candidate | called DFC as for \Decorrelated Fast Cipher" | is based on Vaudenay's decor-relation technique. This provides provable security against several classes of attacks which include the basic version of Biham a...
متن کاملDecorrelated Fast Cipher : an AES CandidateExtended
This report presents a response to the call for candidates issued by the National Institute for Standards and Technologies (the Advanced Encryption Standard project). The proposed candidate | called DFC as for \Decorrelated Fast Cipher" | is based on the recent decorre-lation technique. This provides provable security against several classes of attacks which include Diierential Cryptanalysis an...
متن کاملResistance against Adaptive Plaintext-Ciphertext Iterated Distinguishers
Decorrelation Theory deals with general adversaries who are mounting iterated attacks, i.e., attacks in which an adversary is allowed to make d queries in each iteration with the aim of distinguishing a random cipher C from the ideal random cipher C∗. A bound for a non-adaptive iterated distinguisher of order d, who is making plaintext (resp. ciphertext) queries, against a 2d-decorrelated ciphe...
متن کامل